Method, apparatus, and computer program product for providing motion estimator for video encoding

ABSTRACT

An apparatus for providing motion estimation for video encoding includes a selection element and a processing element. The selection element is configured to select a subset including less than all of candidate pixel locations from among a plurality of candidate pixel locations used for motion vector determination based on a relationship between a best candidate pixel location of a first level of accuracy and a best candidate pixel location of a second level of accuracy. The processing element is configured to process an input video sequence to determine a motion vector at the first level of accuracy, to refine the motion vector at the second level of accuracy, and to determine the motion vector at a third level of accuracy using only the subset of candidate pixel locations.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.11/535,647, filed on Sep. 27, 2006. The above-identified application isherein incorporated by reference in its entirety.

TECHNOLOGICAL FIELD

Embodiments of the present invention relate generally to signalprocessing and video coding technology and, more particularly, relate toa method, apparatus and computer program product for providing fastmotion estimation in a video coding system.

BACKGROUND

The modern communications era has brought about a tremendous expansionof wireline and wireless networks. Computer networks, televisionnetworks, and telephony networks are experiencing an unprecedentedtechnological expansion, fueled by consumer demand. Wireless and mobilenetworking technologies have addressed related consumer demands, whileproviding more flexibility and immediacy of information transfer.

Current and future networking technologies continue to facilitate easeof information transfer and convenience to users. One area in whichthere is a demand to increase the ease of information transfer andconvenience to users relates to provision of various applications orsoftware to users of electronic devices such as mobile terminals. Theapplications or software may be executed from a local computer, anetwork server or other network device, or from the mobile terminal suchas, for example, a mobile telephone, a mobile television, a mobilegaming system, video recorders, cameras, etc, or even from a combinationof the mobile terminal and the network device. In this regard, variousapplications and software have been developed, and continue to bedeveloped, in order to give the users robust capabilities to performtasks, communicate, entertain themselves, gather and/or analyzeinformation, etc. in either fixed or mobile environments.

Given the ubiquitous nature of cameras in mobile terminals and otherresource constrained devices, efforts have been made to improve imagequality and other image processing techniques. For example, certainapplications have been developed to improve image processing byintroducing motion vectors, which are now well known in the art. Motionvectors are used in motion estimation for motion compensated predictionin order to increase coding efficiency. Motion vectors describe therelative motion of a particular block in subsequent frames byrepresenting the motion of the particular block in a frame to theposition of a best match for the particular block in a subsequent frame.By employing motion vectors in describing the motion of blocks insubsequent frames with increased accuracy, state-of-the-art video codingstandards may provide improved video quality at similar bit rates to thebit rates of previous standards. Accordingly, motion vectors aretypically utilized in a motion estimation stage during whichinterpolation steps are performed to estimate the motion vectors.Furthermore, such motion vectors may be produced with accuracies beyondthe integer pixel level to the half or even quarter pixel levels. Futuretechnologies may even be able to increase accuracies beyond the quarterpixel level. However, motion estimation is often one of the more complexoperations of a typical encoder due the interpolation steps performed todetermine the motion vectors. Additionally, when increased accuracy issought, more interpolation steps become advantageous and computationalcomplexity is increased.

Unfortunately, many platforms on which camera images are produced may belimited resource devices such as mobile terminals. Such limited resourcedevices may have limited computational power, battery life, displaysizes, etc. Thus, the increased complexity involved in motion estimationmay increase resource consumption and decrease battery life of suchdevices. Additionally, in real-time encoding use-cases such as videotelephony, if the time used for encoding of a particular frame exceedsan allocated time, the frame may be skipped, thereby reducing quality.Accordingly, it may be increasingly desirable to provide algorithms thatare capable to achieve faster encoding speeds while maintaining imagequality.

BRIEF SUMMARY

A method, apparatus and computer program product are therefore providedfor providing a method, apparatus and computer program product forproviding improved motion estimation for video encoding.

In one exemplary embodiment, a method of providing improved motionestimation for video encoding is provided. The method includesprocessing an input video sequence to determine a motion vector at afirst level of accuracy, refining the motion vector at a second level ofaccuracy, selecting a subset including less than all of candidate pixellocations based on a relationship between corresponding best candidatepixel locations of the first and second levels of accuracy, anddetermining the motion vector at a third level of accuracy using onlythe subset of candidate pixel locations.

In another exemplary embodiment, a computer program product forproviding improved motion estimation for video encoding is provided. Thecomputer program product includes at least one computer-readable storagemedium having computer-readable program code portions stored therein.The computer-readable program code portions include first, second, thirdand fourth executable portions. The first executable portion is forprocessing an input video sequence to determine a motion vector at afirst level of accuracy. The second executable portion is for refiningthe motion vector at a second level of accuracy. The third executableportion is for selecting a subset including less than all of candidatepixel locations based on a relationship between corresponding bestcandidate pixel locations of the first and second levels of accuracy.The fourth executable portion is for determining the motion vector at athird level of accuracy using only the subset of candidate pixellocations.

In another exemplary embodiment, an apparatus for providing improvedmotion estimation for video encoding is provided. The apparatus includesa selection element and a processing element. The selection element isconfigured to select a subset including less than all of candidate pixellocations from among a plurality of candidate pixel locations used formotion vector determination based on a relationship between a bestcandidate pixel location of a first level of accuracy and a bestcandidate pixel location of a second level of accuracy. The processingelement is configured to process an input video sequence to determine amotion vector at the first level of accuracy, to refine the motionvector at the second level of accuracy, and to determine the motionvector at a third level of accuracy using only the subset of candidatepixel locations.

In another exemplary embodiment, an apparatus for providing improvedmotion estimation for video encoding is provided. The apparatus includesmeans for processing an input video sequence to determine a motionvector at a first level of accuracy, means for refining the motionvector at a second level of accuracy, means for selecting a subsetincluding less than all of candidate pixel locations based on arelationship between corresponding best candidate pixel locations of thefirst and second levels of accuracy, and means for determining themotion vector at a third level of accuracy using only the subset ofcandidate pixel locations.

Embodiments of the present invention may be advantageously employed, forexample, in resource constrained devices in order to reduce resourceconsumption by reducing the number of candidate pixel locations forinterpolation. Thus, image quality may be substantially maintained,while encoding efficiency is improved.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING(S)

Having thus described embodiments of the invention in general terms,reference will now be made to the accompanying drawings, which are notnecessarily drawn to scale, and wherein:

FIG. 1 is a schematic block diagram of a mobile terminal according to anexemplary embodiment of the present invention;

FIG. 2 is a schematic block diagram of a wireless communications systemaccording to an exemplary embodiment of the present invention;

FIGS. 3A-3C illustrate schematic diagrams of an exemplary motion vectordetermination;

FIGS. 4A-4H illustrate schematic diagrams of a mechanism for reducing anumber of candidate pixel locations to be checked according to anexemplary embodiment of the present invention;

FIGS. 5A-5H illustrate schematic diagrams of an alternative mechanismfor reducing a number of candidate pixel locations to be checkedaccording to an exemplary embodiment of the present invention;

FIGS. 6A-6B illustrate schematic diagrams of an exemplary motion vectordetermination using a 4×4 block according to an exemplary embodiment ofthe present invention;

FIG. 7 is a schematic block diagram of an encoder according to exemplaryembodiments of the invention;

FIG. 8 is a schematic block diagram of a motion estimation stage of anencoder according to an exemplary embodiment of the present invention;and

FIG. 9 is a flowchart according to an exemplary method of providingmotion estimation for video encoding according to one embodiment of thepresent invention.

DETAILED DESCRIPTION

Embodiments of the present invention will now be described more fullyhereinafter with reference to the accompanying drawings, in which some,but not all embodiments of the invention are shown. Indeed, embodimentsof the invention may be embodied in many different forms and should notbe construed as limited to the embodiments set forth herein; rather,these embodiments are provided so that this disclosure will satisfyapplicable legal requirements. Like reference numerals refer to likeelements throughout.

FIG. 1 illustrates a block diagram of a mobile terminal 10 that wouldbenefit from embodiments of the present invention. It should beunderstood, however, that a mobile telephone as illustrated andhereinafter described is merely illustrative of one type of mobileterminal that would benefit from embodiments of the present inventionand, therefore, should not be taken to limit the scope of embodiments ofthe present invention. While several embodiments of the mobile terminal10 are illustrated and will be hereinafter described for purposes ofexample, other types of mobile terminals, such as portable digitalassistants (PDAs), pagers, mobile televisions, gaming devices, laptopcomputers, cameras, video recorders, GPS devices and other types ofvoice and text communications systems, can readily employ embodiments ofthe present invention. Furthermore, devices that are not mobile may alsoreadily employ embodiments of the present invention.

The system and method of embodiments of the present invention will beprimarily described below in conjunction with mobile communicationsapplications. However, it should be understood that the system andmethod of embodiments of the present invention can be utilized inconjunction with a variety of other applications, both in the mobilecommunications industries and outside of the mobile communicationsindustries.

The mobile terminal 10 includes an antenna 12 (or multiple antennae) inoperable communication with a transmitter 14 and a receiver 16. Themobile terminal 10 further includes a controller 20 or other processingelement that provides signals to and receives signals from thetransmitter 14 and receiver 16, respectively. The signals includesignaling information in accordance with the air interface standard ofthe applicable cellular system, and also user speech and/or usergenerated data. In this regard, the mobile terminal 10 is capable ofoperating with one or more air interface standards, communicationprotocols, modulation types, and access types. By way of illustration,the mobile terminal 10 is capable of operating in accordance with any ofa number of first, second and/or third-generation communicationprotocols or the like. For example, the mobile terminal 10 may becapable of operating in accordance with second-generation (2G) wirelesscommunication protocols IS-136 (TDMA), GSM, and IS-95 (CDMA), or withthird-generation (3G) wireless communication protocols, such as UMTS,CDMA2000, and TD-SCDMA.

It is understood that the controller 20 includes circuitry required forimplementing audio and logic functions of the mobile terminal 10. Forexample, the controller 20 may be comprised of a digital signalprocessor device, a microprocessor device, and various analog to digitalconverters, digital to analog converters, and other support circuits.Control and signal processing functions of the mobile terminal 10 areallocated between these devices according to their respectivecapabilities. The controller 20 thus may also include the functionalityto convolutionally encode and interleave message and data prior tomodulation and transmission. The controller 20 can additionally includean internal voice coder, and may include an internal data modem.Further, the controller 20 may include functionality to operate one ormore software programs, which may be stored in memory. For example, thecontroller 20 may be capable of operating a connectivity program, suchas a conventional Web browser. The connectivity program may then allowthe mobile terminal 10 to transmit and receive Web content, such aslocation-based content, according to a Wireless Application Protocol(WAP), for example.

The mobile terminal 10 also comprises a user interface including anoutput device such as a conventional earphone or speaker 24, a ringer22, a microphone 26, a display 28, and a user input interface, all ofwhich are coupled to the controller 20. The user input interface, whichallows the mobile terminal 10 to receive data, may include any of anumber of devices allowing the mobile terminal 10 to receive data, suchas a keypad 30, a touch display (not shown) or other input device. Inembodiments including the keypad 30, the keypad 30 may include theconventional numeric (0-9) and related keys (#, *), and other keys usedfor operating the mobile terminal 10. Alternatively, the keypad 30 mayinclude a conventional QWERTY keypad arrangement. The keypad 30 may alsoinclude various soft keys with associated functions. In addition, oralternatively, the mobile terminal 10 may include an interface devicesuch as a joystick or other user input interface. The mobile terminal 10further includes a battery 34, such as a vibrating battery pack, forpowering various circuits that are required to operate the mobileterminal 10, as well as optionally providing mechanical vibration as adetectable output.

In an exemplary embodiment, the mobile terminal 10 includes a mediacapturing element, such as a camera, video and/or audio module, incommunication with the controller 20. The media capturing element may beany means for capturing an image, video and/or audio for storage,display or transmission. For example, in an exemplary embodiment inwhich the media capturing element is a camera module 36, the cameramodule 36 may include a digital camera capable of forming a digitalimage file from a captured image. As such, the camera module 36 includesall hardware, such as a lens or other optical component(s), and softwarenecessary for creating a digital image file from a captured image.Alternatively, the camera module 36 may include only the hardware neededto view an image, while a memory device of the mobile terminal 10 storesinstructions for execution by the controller 20 in the form of softwarenecessary to create a digital image file from a captured image. In anexemplary embodiment, the camera module 36 may further include aprocessing element such as a co-processor which assists the controller20 in processing image data and an encoder and/or decoder forcompressing and/or decompressing image data. The encoder and/or decodermay encode and/or decode according to a JPEG standard format.

The mobile terminal 10 may further include a universal identity module(UIM) 38. The UIM 38 is typically a memory device having a processorbuilt in. The UIM 38 may include, for example, a subscriber identitymodule (SIM), a universal integrated circuit card (UICC), a universalsubscriber identity module (USIM), a removable user identity module(R-UIM), etc. The UIM 38 typically stores information elements relatedto a mobile subscriber. In addition to the UIM 38, the mobile terminal10 may be equipped with memory. For example, the mobile terminal 10 mayinclude volatile memory 40, such as volatile Random Access Memory (RAM)including a cache area for the temporary storage of data. The mobileterminal 10 may also include other non-volatile memory 42, which can beembedded and/or may be removable. The non-volatile memory 42 canadditionally or alternatively comprise an EEPROM, flash memory or thelike, such as that available from the SanDisk Corporation of Sunnyvale,Calif., or Lexar Media Inc. of Fremont, Calif. The memories can storeany of a number of pieces of information, and data, used by the mobileterminal 10 to implement the functions of the mobile terminal 10. Forexample, the memories can include an identifier, such as aninternational mobile equipment identification (IMEI) code, capable ofuniquely identifying the mobile terminal 10.

Referring now to FIG. 2, an illustration of one type of system thatwould benefit from embodiments of the present invention is provided. Thesystem includes a plurality of network devices. As shown, one or moremobile terminals 10 may each include an antenna 12 for transmittingsignals to and for receiving signals from a base site or base station(BS) 44. The base station 44 may be a part of one or more cellular ormobile networks each of which includes elements required to operate thenetwork, such as a mobile switching center (MSC) 46. As well known tothose skilled in the art, the mobile network may also be referred to asa Base Station/MSC/interworking function (BMI). In operation, the MSC 46is capable of routing calls to and from the mobile terminal 10 when themobile terminal 10 is making and receiving calls. The MSC 46 can alsoprovide a connection to landline trunks when the mobile terminal 10 isinvolved in a call. In addition, the MSC 46 can be capable ofcontrolling the forwarding of messages to and from the mobile terminal10, and can also control the forwarding of messages for the mobileterminal 10 to and from a messaging center. It should be noted thatalthough the MSC 46 is shown in the system of FIG. 2, the MSC 46 ismerely an exemplary network device and embodiments of the presentinvention are not limited to use in a network employing an MSC.

The MSC 46 can be coupled to a data network, such as a local areanetwork (LAN), a metropolitan area network (MAN), and/or a wide areanetwork (WAN). The MSC 46 can be directly coupled to the data network.In one typical embodiment, however, the MSC 46 is coupled to a GTW 48,and the GTW 48 is coupled to a WAN, such as the Internet 50. In turn,devices such as processing elements (e.g., personal computers, servercomputers or the like) can be coupled to the mobile terminal 10 via theInternet 50. For example, as explained below, the processing elementscan include one or more processing elements associated with a computingsystem 52 (two shown in FIG. 2), origin server 54 (one shown in FIG. 2)or the like, as described below.

The BS 44 can also be coupled to a signaling GPRS (General Packet RadioService) support node (SGSN) 56. As known to those skilled in the art,the SGSN 56 is typically capable of performing functions similar to theMSC 46 for packet switched services. The SGSN 56, like the MSC 46, canbe coupled to a data network, such as the Internet 50. The SGSN 56 canbe directly coupled to the data network. In a more typical embodiment,however, the SGSN 56 is coupled to a packet-switched core network, suchas a GPRS core network 58. The packet-switched core network is thencoupled to another GTW 48, such as a GTW GPRS support node (GGSN) 60,and the GGSN 60 is coupled to the Internet 50. In addition to the GGSN60, the packet-switched core network can also be coupled to a GTW 48.Also, the GGSN 60 can be coupled to a messaging center. In this regard,the GGSN 60 and the SGSN 56, like the MSC 46, may be capable ofcontrolling the forwarding of messages, such as MMS messages. The GGSN60 and SGSN 56 may also be capable of controlling the forwarding ofmessages for the mobile terminal 10 to and from the messaging center.

In addition, by coupling the SGSN 56 to the GPRS core network 58 and theGGSN 60, devices such as a computing system 52 and/or origin server 54may be coupled to the mobile terminal 10 via the Internet 50, SGSN 56and GGSN 60. In this regard, devices such as the computing system 52and/or origin server 54 may communicate with the mobile terminal 10across the SGSN 56, GPRS core network 58 and the GGSN 60. By directly orindirectly connecting mobile terminals 10 and the other devices (e.g.,computing system 52, origin server 54, etc.) to the Internet 50, themobile terminals 10 may communicate with the other devices and with oneanother, such as according to the Hypertext Transfer Protocol (HTTP), tothereby carry out various functions of the mobile terminals 10.

Although not every element of every possible mobile network is shown anddescribed herein, it should be appreciated that the mobile terminal 10may be coupled to one or more of any of a number of different networksthrough the BS 44. In this regard, the network(s) can be capable ofsupporting communication in accordance with any one or more of a numberof first-generation (1G), second-generation (2G), 2.5G and/orthird-generation (3G) mobile communication protocols or the like. Forexample, one or more of the network(s) can be capable of supportingcommunication in accordance with 2G wireless communication protocolsIS-136 (TDMA), GSM, and IS-95 (CDMA). Also, for example, one or more ofthe network(s) can be capable of supporting communication in accordancewith 2.5G wireless communication protocols GPRS, Enhanced Data GSMEnvironment (EDGE), or the like. Further, for example, one or more ofthe network(s) can be capable of supporting communication in accordancewith 3G wireless communication protocols such as a Universal MobileTelephone System (UMTS) network employing Wideband Code DivisionMultiple Access (WCDMA) radio access technology. Some narrow-band AMPS(NAMPS), as well as TACS, network(s) may also benefit from embodimentsof the present invention, as should dual or higher mode mobile stations(e.g., digital/analog or TDMA/CDMA/analog phones).

The mobile terminal 10 can further be coupled to one or more wirelessaccess points (APs) 62. The APs 62 may comprise access points configuredto communicate with the mobile terminal 10 in accordance with techniquessuch as, for example, radio frequency (RF), Bluetooth (BT), infrared(IrDA) or any of a number of different wireless networking techniques,including wireless LAN (WLAN) techniques such as IEEE 802.11 (e.g.,802.11a, 802.11b, 802.11g, 802.11n, etc.), WiMAX techniques such as IEEE802.16, and/or ultra wideband (UWB) techniques such as IEEE 802.15 orthe like. The APs 62 may be coupled to the Internet 50. Like with theMSC 46, the APs 62 can be directly coupled to the Internet 50. In oneembodiment, however, the APs 62 are indirectly coupled to the Internet50 via a GTW 48. Furthermore, in one embodiment, the BS 44 may beconsidered as another AP 62. As will be appreciated, by directly orindirectly connecting the mobile terminals 10 and the computing system52, the origin server 54, and/or any of a number of other devices, tothe Internet 50, the mobile terminals 10 can communicate with oneanother, the computing system, etc., to thereby carry out variousfunctions of the mobile terminals 10, such as to transmit data, contentor the like to, and/or receive content, data or the like from, thecomputing system 52. As used herein, the terms “data,” “content,”“information” and similar terms may be used interchangeably to refer todata capable of being transmitted, received and/or stored in accordancewith embodiments of the present invention. Thus, use of any such termsshould not be taken to limit the spirit and scope of the presentinvention.

Although not shown in FIG. 2, in addition to or in lieu of coupling themobile terminal 10 to computing systems 52 across the Internet 50, themobile terminal 10 and computing system 52 may be coupled to one anotherand communicate in accordance with, for example, RF, BT, IrDA or any ofa number of different wireline or wireless communication techniques,including LAN, WLAN, WiMAX and/or UWB techniques. One or more of thecomputing systems 52 can additionally, or alternatively, include aremovable memory capable of storing content, which can thereafter betransferred to the mobile terminal 10. Further, the mobile terminal 10can be coupled to one or more electronic devices, such as printers,digital projectors and/or other multimedia capturing, producing and/orstoring devices (e.g., other terminals). Like with the computing systems52, the mobile terminal 10 may be configured to communicate with theportable electronic devices in accordance with techniques such as, forexample, RF, BT, IrDA or any of a number of different wireline orwireless communication techniques, including USB, LAN, WLAN, WiMAXand/or UWB techniques.

As described above, when encoding video data, it is currently possiblefor motion estimation to be performed in order to increase compressionefficiency. For example, the H.264/AVC video coding standard, whichprovides improved video quality over previous standards with a similarbit rate due to use of motion estimation employing motion vectors, hasbeen increasingly utilized in third generation mobile multimediaservices, digital video broadcasting to handheld (DVB-H) and highdefinition digital versatile discs (HD-DVD). However, since such motionestimation typically involves increased complexity in order to achieveincreased accuracy, resource consumption is also increased. In thisregard, FIG. 3 shows an example of motion estimation that could beperformed. For simplicity, FIG. 3 assumes that an encoder is trying tofind the best match of an original pixel in the reference picture. Inother words, FIG. 3 shows a motion search for a block of 1 pixel in sizefor illustration purposes. However, as is well known to those skilled inthe art, an encoder would perform motion estimation in a block-by-blockbasis. As shown in FIG. 3, motion estimation typically includes a seriesof operations that are performed in order to develop a motion vector(MV) 68 describing the motion from an original pixel location 80 to areference pixel location 90 using quarter pixel accuracy. However, asshown in FIG. 3, the motion estimation is performed at a series ofdifferent accuracy levels such that, initially the encoder finds a bestcandidate integer pixel location 82 as the pixel that matches best tothe reference pixel at the integer pixel level and then proceeds toperform similar searches at the half and quarter pixel levels.

In general, determination of the MV 68 involves finding a referenceblock (or pixel in this case where the block is 1 pixel in size) thatmost closely matches the original pixel location 80 in a reference frameand the MV 68 is a vector describing the motion from the original pixellocation 80 to the position of the block that most closely matches theoriginal pixel location 80 in the reference frame. In determining whichblock most closely matches the original block (i.e., block of theoriginal pixel location 80), numerous measures could be employed. Forexample, a block could be selected as the block that most closelymatches the original block in response to minimization of a distortionmeasure, a sum of absolute difference, or a difference between the blockand the original block. It should be noted, however, that any similaritymeasure or difference measure may be employed to determine the blockthat most closely matches the original block. Furthermore, in someapplications, it may be possible for values of a plurality of candidateblocks that are checked to be known to, stored by, or otherwiseaccessible to a device practicing the methods disclosed herein forcomparison to an original block for determination of which candidateblock most closely matches the original block.

In order to increase the accuracy of the MV 68, movement of the originalblock may be tracked at levels more accurate than simply at the integerpixel level. For example, movement of the original block may be trackedat a half pixel level, a quarter pixel level, or perhaps even a moreaccurate level than the quarter pixel level. In this regard, integerpixel locations 72 are represented in FIG. 3 and following as a squareshape. Every fourth pixel location in vertical, horizontal and diagonaldirections may be considered to be an integer pixel location. Half pixellocations 74 are disposed half way between each integer pixel locationand are represented as circle shapes in FIG. 3 and following.Accordingly, there are eight half pixel locations 74 which may beconsidered proximate to any particular integer pixel location. Allremaining pixel locations may be considered quarter pixel locations (orquarter pels (QPELs)) 76 and are represented by “X” shapes in FIG. 3 andfollowing.

As described above, in order to accurately determine the MV 68 at theQPEL level of accuracy, a series of operations may be performed in orderto find the block that most closely matches the original block with QPELaccuracy. In this regard, a first operation, represented by firstcomponent vector 78 shown in FIG. 3A, finds the MV with integeraccuracy. For example, the first component vector 78 may describe avector MV_(X), MV_(Y) defining motion from the original pixel location80 (i.e., the original block) to a block defined at the integer pixellevel which provides the closest match to the original block. In thefirst component vector 78, MV_(X) describes a vertical component of thevector and MV_(Y) describes a horizontal component of the vector.

When determining the block which provides the closest match to theoriginal block, a value of a candidate block at a particular accuracylevel is compared to a corresponding value of the original block todetermine a candidate block that most closely matches the originalblock. Accordingly, the first component vector 78 describes motion ofthe original block to a location of a best candidate integer pixellocation 82 which most closely matches the original block among allcandidate integer pixel locations 72. A candidate block at any givenaccuracy level that most closely matches the original block may beconsidered a best candidate block at the given accuracy level. Thus, ifmultiple iterations of calculations are performed in order to improvethe level of accuracy of determining the best candidate block, there maybe a different candidate block which is considered the best candidateblock for each corresponding level of accuracy. As such, a pixellocation of a best candidate block at an accuracy level that correspondsto the original pixel location 80 may be considered a best candidatepixel location for the corresponding accuracy level.

A second operation may be performed, as shown in FIG. 3B, to furtherrefine the result of the first operation. In the second operation, whichis represented by second component vector 84, the MV is found with halfpixel accuracy. In other words, a best candidate block is found at thehalf pixel level by performing similarity or difference measures betweeneach candidate block at the half pixel level to find the candidate blockthat most closely matches the original block with half pixel accuracy.The second component vector 84 may be described by the vector MV_(H)_(_) _(X), MV_(H) _(_) _(Y) which describes motion from the bestcandidate integer pixel location 82 to a best candidate half pixellocation 86. As such, a MV drawn from the original pixel location 80 tothe best candidate half pixel location 86 would describe a MV at halfpixel accuracy.

A third operation may be performed as shown in FIG. 3C, to furtherrefine the result of the second operation. In the third operation, whichis represented by third component vector 88, the MV 68 is found withquarter pixel accuracy. In other words, a best candidate block is foundat the quarter pixel level by performing similarity or differencemeasures between each candidate block at the quarter pixel level to findthe candidate block that most closely matches the original block withquarter pixel accuracy. The third component vector 88 may be describedby the vector MV_(Q) _(_) _(X), MV_(Q) _(_) _(Y) which describes motionfrom the best candidate half pixel location 86 to the best candidatequarter pixel location 90. As such, the MV 68 drawn from the originalpixel location 80 to the best candidate quarter pixel location 90describes the MV 68 at quarter pixel accuracy. It may be possible in thefuture to continue the operations above to yet further levels ofaccuracy and thus, it should be noted that the principles describedherein also apply to the extension of motion estimation to furtherlevels of accuracy.

As indicated above, in order to determine the best candidate pixellocation at either the integer, half or quarter pixel levels,interpolation must be performed in order to determine which candidateblock defined at a corresponding level most closely matches the originalblock. Accordingly, in order to complete the first operation describedabove, a similarity or difference measure must be performed for eachcandidate integer pixel location in order to determine the bestcandidate integer pixel location 82. Similarly, in order to complete thesecond operation described above, a similarity or difference measuremust be performed for each candidate half pixel location in order todetermine the best candidate half pixel location 86. As such, as shownby the dotted line 92 of FIG. 3B, there are nine candidate half pixels(the integer pixel location is also a half pixel location) for which thesimilarity or difference measure must be performed in order to determinethe best candidate half pixel location 86. Additionally, in order tocomplete the third operation described above, a similarity or differencemeasure must be performed for each candidate quarter pixel location inorder to determine the best candidate quarter pixel location 90. Assuch, as shown by the dotted line 94 of FIG. 3C, there are ninecandidate quarter pixels (the half pixel location is also a quarterpixel location) for which the similarity or difference measure must beperformed in order to determine the best candidate quarter pixellocation 90.

However, by examining the nine candidate quarter pixel locations whichare proximate to the best candidate half pixel location 86, it can beseen that at least a portion of those candidate quarter pixel locationsmay be relatively unlikely to be selected as the best candidate quarterpixel location 90 since some of the candidate quarter pixel locationsare in fact proximate to a different integer pixel location than thebest candidate integer pixel location 82. Thus, if a candidate blockbased on these candidate quarter pixel locations (i.e., the candidatequarter pixel locations proximate to the different integer pixellocation) were to provide the block that provides the closest match tothe original block, it may be more likely that the other candidateinteger pixel location would have been selected as the best candidateinteger pixel location. Accordingly, it may be possible to furthersimplify the motion estimation process by eliminating a certain numberof candidate pixel locations and thereby reducing the amount ofcalculation required to determine the MV 68. Thus, a reduced number ofcandidate pixel locations may be selected and only the reduced number ofcandidate pixel locations may be checked for similarity/differencerelative to the original block. In other words, comparison betweencandidate blocks and the original block may be reduced since suchcomparisons may only be calculated for selected candidate blockscorresponding to the reduced number of candidate pixel locations. In anexemplary embodiment, the number of candidate pixel locations may bereduced by at least one half, or as shown in FIGS. 4 and 5, by about onethird.

In this regard, FIGS. 4 and 5 illustrate schematic diagrams showingexamples of a method for selecting a reduced number of candidate pixelsto be checked for similarity or difference with respect to the originalblock in order to determine the MV 68 according to exemplary embodimentsof the present invention. It should be noted that although FIGS. 4 and 5illustrate the operation of the method at the QPEL level, the methodcould also be performed at other levels as well. Additionally, althoughFIGS. 4 and 5 each illustrate the selection of three candidate pixels tobe checked, it should be understood that any suitable number ofcandidate pixels could alternatively be selected in embodiments of thepresent invention so long as such selection results in a decrease in thenumber of candidate pixels that will be checked as compared to theembodiment described in reference to FIG. 3.

FIG. 4 illustrates the selection of a reduced number of candidatequarter pixel locations to be checked according to exemplaryembodiments. In this regard, FIGS. 4A and 4B show selection of thereduced number of candidate pixel locations to be checked for selectionof the MV 68 in which the best candidate half pixel location 86 isvertically displaced from the best candidate integer pixel location 82.In other words, the second component vector 84 has only a verticalcomponent and no horizontal component. In FIGS. 4A and 4B, pixellocations selected to be checked (i.e., a subset of candidate pixellocations) are enclosed within dotted line 96. Computations fordetermining the block that most closely matches the original block maythen only be calculated for the pixel locations selected to be checked,thereby reducing computational complexity. As seen in FIGS. 4A and 4B,in an exemplary embodiment, the pixel locations selected to be checkedare the candidate pixel locations that are disposed between the bestcandidate integer pixel location 82 and the best candidate half pixellocation 86.

FIGS. 4C, 4D, 4E and 4F show selection of the reduced number ofcandidate pixel locations to be checked for selection of the MV 68 inwhich the best candidate half pixel location 86 is diagonally displacedfrom the best candidate integer pixel location 82. In other words, thesecond component vector 84 has both a vertical component and ahorizontal component. In FIGS. 4C, 4D, 4E and 4F, pixel locationsselected to be checked are enclosed within dotted line 96. Computationsfor determining the block that most closely matches the original blockmay then only be calculated for the pixel locations selected to bechecked, thereby reducing computational complexity. As also seen inFIGS. 4C, 4D, 4E and 4F, in an exemplary embodiment, the pixel locationsselected to be checked are the candidate pixel locations that areproximate to the best candidate half pixel location 86 and disposedbetween the best candidate integer pixel location 82 and the bestcandidate half pixel location 86.

FIGS. 4G and 4H show selection of the reduced number of candidate pixellocations to be checked for selection of the MV 68 in which the bestcandidate half pixel location 86 is horizontally displaced from the bestcandidate integer pixel location 82. In other words, the secondcomponent vector 84 has only a horizontal component and no verticalcomponent. In FIGS. 4G and 4H, pixel locations selected to be checkedare enclosed within dotted line 96. Computations for determining theblock that most closely matches the original block may then only becalculated for the pixel locations selected to be checked, therebyreducing computational complexity as described above. As seen in FIGS.4G and 4H, in an exemplary embodiment, the pixel locations selected tobe checked are the candidate pixel locations that are disposed betweenthe best candidate integer pixel location 82 and the best candidate halfpixel location 86.

In summary, for each of the scenarios presented in FIG. 4, the subset ofcandidate pixel locations that is selected to be checked includes onlythose pixel locations that are proximate to the best candidate halfpixel location 86 and disposed between the best candidate integer pixellocation 82 and the best candidate half pixel location 86.

FIG. 5 illustrates the selection of a reduced number of candidatequarter pixel locations to be checked according to exemplary embodimentsin which the second component vector 84 is zero. In other words, in asituation in which the best candidate half pixel location 86 is the sameas the best candidate integer pixel location 82, the method describedabove with reference to FIG. 4 may not be preferable. As such, oneoption would be to perform calculations or check each of the candidatequarter pixel locations that are proximate to the best candidate integerpixel location 82. However, in order to simplify calculations, if asecond best candidate half pixel location is known, it may be possibleto reduce computational complexity by selecting a reduced number ofcandidate pixel locations to be checked as set forth below.

In this regard, FIGS. 5A and 5B show selection of the reduced number ofcandidate pixel locations to be checked for selection of the MV 68 inwhich the second best candidate half pixel location 98 is verticallydisplaced from the best candidate integer pixel location 82. In FIGS. 5Aand 5B, pixel locations selected to be checked are enclosed withindotted line 96. Computations for determining the block that most closelymatches the original block may then only be calculated for the pixellocations selected to be checked, thereby reducing computationalcomplexity. As seen in FIGS. 5A and 5B, in an exemplary embodiment, thepixel locations selected to be checked are the candidate pixel locationsthat are disposed between the best candidate integer pixel location 82and the second best candidate half pixel location 98.

FIGS. 5C, 5D, 5E and 5F show selection of the reduced number ofcandidate pixel locations to be checked for selection of the MV 68 inwhich the second best candidate half pixel location 98 is diagonallydisplaced from the best candidate integer pixel location 82. In FIGS.5C, 5D, 5E and 5F, pixel locations selected to be checked are enclosedwithin dotted line 96. As such, the pixel locations selected to bechecked are the candidate pixel locations that are proximate to the bestcandidate integer pixel location 82 and disposed between the bestcandidate integer pixel location 82 and the second best candidate halfpixel location 98.

FIGS. 5G and 5H show selection of the reduced number of candidate pixellocations to be checked for selection of the MV 68 in which the secondbest candidate half pixel location 98 is horizontally displaced from thebest candidate integer pixel location 82. In FIGS. 5G and 5H, pixellocations selected to be checked are enclosed within dotted line 96.Computations for determining the block that most closely matches theoriginal block may then only be calculated for the pixel locationsselected to be checked, thereby reducing computational complexity asdescribed above. As seen in FIGS. 5G and 5H, in an exemplary embodiment,the pixel locations selected to be checked are the candidate pixellocations that are disposed between the best candidate integer pixellocation 82 and the second best candidate half pixel location 98.

In summary, for each of the scenarios presented in FIG. 5, the subset ofcandidate pixel locations that is selected to be checked includes onlythose pixel locations that are proximate to the best candidate integerpixel location 82 and disposed between the best candidate integer pixellocation 82 and the second best candidate half pixel location 98.

Accordingly, as shown in FIGS. 4 and 5 above, the pixel locationsselected to be checked form a subset of candidate pixel locations thatis selected based upon a proximity of the subset of candidate pixellocations to particular candidate pixel locations of precedingsequential levels of accuracy. More specifically, as shown in FIG. 4above, the subset of candidate pixel locations is selected based uponproximity to the best candidate pixel locations of preceding sequentiallevels of accuracy. Meanwhile, as shown in FIG. 5 above, the subset ofcandidate pixel locations is selected based on proximity to the secondbest candidate pixel location of a preceding level of accuracy and tothe best candidate pixel location of a sequential level of accuracyprior to the preceding level of accuracy. Embodiments of the presentinvention have been shown to reduce the number of QPEL checks used forencoding standard video sequences by between about 21 to 55 percent,with an average reduction of about 37 percent.

As stated above, FIGS. 3-5 illustrate a motion search for a block sizeof 1 pixel in order to show the direction of movement of a block insimpler terms. FIG. 6 illustrates a schematic diagram of an exemplarymotion vector determination using a 4×4 block according to an exemplaryembodiment of the present invention. As shown in FIG. 6B, an originalblock 70 in a particular frame may be defined as a 4×4 matrix of integerpixel locations. An embodiment of the present invention may then beemployed to determine motion of the original block 70 to the position ofa reference block 71 in a reference frame as shown in FIG. 6A. As such,using the operations described above, the reference block 71 may beconsidered the block that most closely matches the original block 70 atquarter pixel accuracy. Thus, a motion vector defines motion from aposition of the original block 70 to a position of the reference block71.

FIG. 7 is a schematic block diagram of an encoder according to exemplaryembodiments of the invention. FIG. 7 shows elements of an encoder 100which may be employed, for example, in the mobile terminal 10 of FIG. 1.However, it should be noted that the encoder 100 of FIG. 7 may also beemployed on a variety of other devices, both mobile and fixed, andtherefore, embodiments of the present invention should not be limited toapplication on devices such as the mobile terminal 10 of FIG. 1. Forexample, the encoder 100 of FIG. 7 may be employed on a computingsystem, a video recorder, such as a DVD player, HD-DVD players, DigitalVideo Broadcast (DVB) handheld devices, personal digital assistants(PDAs), digital television set-top boxes, gaming and/or media consoles,etc. The encoder 100 may be any device or means embodied in eitherhardware, software, or a combination of hardware and software that iscapable of encoding a video sequence having a plurality of video frames.In an exemplary embodiment, the encoder 100 may be embodied in softwareinstructions stored in a memory of the mobile terminal 10 and executedby the controller 20. It should be noted that while FIG. 7 illustratesone example of a configuration of the encoder 100, numerous otherconfigurations may also be used to implement embodiments of the presentinvention.

Referring now to FIG. 7, the encoder 100, as generally known to thoseskilled in the art that is capable of encoding an incoming videosequence is provided. As shown in FIG. 7, an input video frame F_(n)(transmitted for example from a video source such as a camera module 36)may be received by the encoder 100. The input video frame F_(n) isprocessed in units of a macroblock. The input video frame F_(n) issupplied to the positive input of a difference block 102 and the outputof the difference block 102 is provided to a transformation block 104 sothat a set of transform coefficients based on the input video frameF_(n) can be generated. The set of transform coefficients are thentransmitted to a quantize block 106 which quantizes each input videoframe to generate a quantized frame having a set of quantized transformcoefficients. Loop 108 supplies the quantized frame to inverse quantizeblock 110 and inverse transformation block 112 which respectivelyperform inverse quantization of the quantized frames and inversetransformation of the transform coefficients. The resulting frame outputfrom inverse transformation block 112 is sent to a summation block 114which supplies the frame to filter 116 in order to reduce the effects ofblocking distortion. The filtered frame may serve as a reference frameand may be stored in reference frame memory 118. As shown in FIG. 7, thereference frame may be a previously encoded frame F′_(n-1). MotionCompensated Prediction (MCP) block 120 performs motion compensatedprediction based on a reference frame stored in reference frame memory118 to generate a prediction macroblock that is motion compensated basedon a motion vector generated by motion estimation block 130. The motionestimation block 130 determines the motion vector from a best matchmacroblock in video frame F_(n). The motion compensated block 120 shiftsa corresponding macroblock in the reference frame based on this motionvector to generate the prediction macroblock.

The H.264/AVC video coding standard allows each macroblock to be encodedin either INTRA or INTER mode. In other words, the H.264/AVC videocoding standard permits the encoder to choose whether to encode in theINTRA or INTER mode. In order to effectuate INTER mode coding,difference block 102 has a negative output coupled to MCP block 120 viaselector 122. In this regard, the difference block 102 subtracts theprediction macroblock from the best match of a macroblock in the currentvideo frame F_(n) to produce a residual or difference macroblock D_(n).The difference macroblock is transformed and quantized by transformationblock 104 and quantize block 106 to provide a set of quantized transformcoefficients. These coefficients may be entropy encoded by entropyencode block 124. The entropy encoded coefficients together withresidual data required to decode the macroblock, (such as the macroblockprediction mode, quantizer step size, motion vector informationspecifying the manner in which the macroblock was motion compensated,etc.) form a compressed bitstream of an encoded macroblock. The encodedmacroblock may be passed to a Network Abstraction Layer (NAL) fortransmission and/or storage.

As will be appreciated by those skilled in the art, H.264/AVC supportstwo block types (sizes) for INTRA coding, namely, 4×4 and 16×16.However, encoders supporting other block sizes may also practiceembodiments of the present invention.

An exemplary embodiment of the invention will now be described withreference to FIG. 8, in which certain elements of a motion estimationelement for providing motion estimation for video encoding aredisplayed. The system of FIG. 8 may be employed, for example, on themobile terminal 10 of FIG. 1. However, it should be noted that thesystem of FIG. 6 may also be employed on a variety of other devices,both mobile and fixed, and therefore, embodiments of the presentinvention should not be limited to application on devices such as themobile terminal 10 of FIG. 1 although an exemplary embodiment of theinvention will be described in greater detail below in the context ofapplication in a mobile terminal. Such description below is given by wayof example and not of limitation. For example, the system of FIG. 8 maybe employed on a camera, a video recorder, etc. Furthermore, the systemof FIG. 8 may be employed on a device, component, element or module ofthe mobile terminal 10. It should also be noted that while FIG. 8illustrates one example of a configuration of the motion estimationelement, numerous other configurations may also be used to implementembodiments of the present invention.

Referring now to FIG. 8, the motion estimation element 130 for providingmotion estimation for video encoding may receive an input from anynumber of image data sources such as, for example, the camera module 36.The motion estimation element 130 according to embodiments of thepresent invention may alternatively be embodied as any device or meansembodied in either hardware, software, or a combination of hardware andsoftware that is capable of, among other things, calculating motionvectors as described in greater detail above. In this regard, the motionestimation element 130 may be disposed within an image processing chainsuch that, for example, images such as video images captured at thecamera module 36 are automatically processed at the motion estimationelement 130 as a part of the normal image processing chain.Alternatively, the motion estimation element 130 may be selectivelyemployed either automatically based on device settings or upon userselection.

In an exemplary embodiment, the motion estimation element 130 mayinclude a processing element 132 and a selection element 134. Theprocessing element 132 may be capable of executing, for example, asearch algorithm or any other mechanism for determining best candidatepixel locations at each corresponding accuracy level. In this regard,the processing element 132 may be capable of executing instructions fordetermining a similarity or difference between a candidate block and theoriginal block 70 as described above for every candidate block ofinterest. As such candidate blocks of interest may be determined by thelevel of accuracy desired. For example, if QPEL accuracy is desired,calculations may be performed for all candidate blocks at the integerand half pixel levels in order to determine the best candidate integerand half pixel locations as described above while calculations areperformed for only candidate blocks corresponding to the subset ofcandidate pixel locations at the quarter pixel level. The processingelement 132 may be embodied in many ways. For example, the processingelement 132 may be embodied as a processor, a coprocessor, a controlleror various other processing means or devices including integratedcircuits such as, for example, an ASIC (application specific integratedcircuit). In an exemplary embodiment, the processing element 132 could,for example, be the controller 20 of FIG. 1.

The selection element 134 may be embodied as any device or meansembodied in either hardware, software, or a combination of hardware andsoftware that is capable of determining the subset of candidate pixellocations to be checked as described above. The selection element 134may be in communication with the processing element 132 in order tocommunicate the subset of candidate pixel locations to the processingelement 132, thereby enabling the processing element 132 to selectivelydetermine the MV 68 to the respective desired accuracy level with areduced number of calculations.

FIG. 9 is a flowchart of a system, methods and program productsaccording to exemplary embodiments of the invention. It will beunderstood that each block or step of the flowchart, and combinations ofblocks in the flowchart, can be implemented by various means, such ashardware, firmware, and/or software including one or more computerprogram instructions. For example, one or more of the proceduresdescribed above may be embodied by computer program instructions. Inthis regard, the computer program instructions which embody theprocedures described above may be stored by a memory device of themobile terminal and executed by a built-in processor in the mobileterminal. As will be appreciated, any such computer program instructionsmay be loaded onto a computer or other programmable apparatus (i.e.,hardware) to produce a machine, such that the instructions which executeon the computer or other programmable apparatus create means forimplementing the functions specified in the flowcharts block(s) orstep(s). These computer program instructions may also be stored in acomputer-readable memory that can direct a computer or otherprogrammable apparatus to function in a particular manner, such that theinstructions stored in the computer-readable memory produce an articleof manufacture including instruction means which implement the functionspecified in the flowcharts block(s) or step(s). The computer programinstructions may also be loaded onto a computer or other programmableapparatus to cause a series of operational steps to be performed on thecomputer or other programmable apparatus to produce acomputer-implemented process such that the instructions which execute onthe computer or other programmable apparatus provide steps forimplementing the functions specified in the flowcharts block(s) orstep(s).

Accordingly, blocks or steps of the flowcharts support combinations ofmeans for performing the specified functions, combinations of steps forperforming the specified functions and program instruction means forperforming the specified functions. It will also be understood that oneor more blocks or steps of the flowcharts, and combinations of blocks orsteps in the flowcharts, can be implemented by special purposehardware-based computer systems which perform the specified functions orsteps, or combinations of special purpose hardware and computerinstructions.

In this regard, one embodiment of a method of providing motionestimation for video encoding, as shown in FIG. 9, may includeprocessing an input video sequence to determine a motion vector at afirst level of accuracy at operation 200. In an exemplary embodiment,operation 200 may include determining the best candidate pixel locationof the first level of accuracy corresponding to a candidate block in areference frame that most closely matches an original block at the firstlevel of accuracy, which may be an integer pixel level of accuracy. Atoperation 210, the motion vector may be refined to a second and higherlevel of accuracy such as half pixel (or half pel) accuracy. In anexemplary embodiment, operation 210 may include determining the bestcandidate pixel location of the second level of accuracy correspondingto a candidate block in a reference frame that most closely matches theoriginal block at the second level of accuracy. A subset of candidatepixel locations may be selected based on a relationship betweencorresponding best candidate pixel locations of the first and secondlevels of accuracy at operation 220. Selecting the subset of candidatepixel locations may include selecting only candidate pixel locationsthat are proximate to the best candidate pixel location of the secondlevel of accuracy and between the best candidate pixel location of thesecond level of accuracy and the best candidate pixel location of thefirst level of accuracy if the best candidate pixel location of thesecond level of accuracy is different than the best candidate pixellocation of the first level of accuracy. Alternatively, selecting thesubset of candidate pixel locations may include selecting only candidatepixel locations that are proximate to the best candidate pixel locationof the first level of accuracy and between the best candidate pixellocation of the first level of accuracy and a second best candidatepixel location of the second level of accuracy if the best candidatepixel location of the second level of accuracy is the same as the bestcandidate pixel location of the first level of accuracy and if thesecond best candidate pixel location is known. In an exemplaryembodiment, less than half of a total number of candidate pixellocations may be selected as the subset of candidate pixel locations inorder to reduce the number of calculations required to determine themotion vector by having a decreased number of candidate pixel locationsfor which calculations are performed. At operation 230, the motionvector is determined at a third level of accuracy using only the subsetof candidate pixel locations. In an exemplary embodiment, operation 230may include determining the best candidate pixel location of the thirdlevel of accuracy corresponding to a candidate block in a referenceframe that most closely matches an original block at the third level ofaccuracy.

The above described functions may be carried out in many ways. Forexample, any suitable means for carrying out each of the functionsdescribed above may be employed to carry out embodiments of theinvention. In one embodiment, all or a portion of the elements of theinvention generally operate under control of a computer program product.The computer program product for performing the methods of embodimentsof the invention includes a computer-readable storage medium, such asthe non-volatile storage medium, and computer-readable program codeportions, such as a series of computer instructions, embodied in thecomputer-readable storage medium.

Many modifications and other embodiments of the inventions set forthherein will come to mind to one skilled in the art to which theseembodiments pertain having the benefit of the teachings presented in theforegoing descriptions and the associated drawings. Therefore, it is tobe understood that the inventions are not to be limited to the specificembodiments disclosed and that modifications and other embodiments areintended to be included within the scope of the appended claims.Although specific terms are employed herein, they are used in a genericand descriptive sense only and not for purposes of limitation.

What is claimed is:
 1. A method comprising: processing an input videosequence to determine a motion vector at a first level of accuracy;refining the motion vector at a second level of accuracy; selecting,with a selection element, a subset including less than all of candidatepixel locations at least partially based on whether a best candidatepixel location of the second level of accuracy is the same as a bestcandidate pixel location of the first level of accuracy; and determiningthe motion vector at a third level of accuracy based on the subset ofcandidate pixel locations, wherein when the best candidate location ofthe second level of accuracy is not the same as the best candidate pixellocation of the first level of accuracy, selecting the subset ofcandidate pixel locations comprises selecting candidate pixel locationsproximate to the best candidate pixel locations of the second level ofaccuracy that are between the best candidate pixel location of thesecond level of accuracy and the best candidate pixel location of thefirst level of accuracy.
 2. The method according to claim 1, whereinwhen the best candidate pixel location of the second level of accuracyis the same as the best candidate pixel location of the first level ofaccuracy and a second best candidate pixel location of the second levelof accuracy is known, selecting the subset of candidate pixel locationscomprises selecting candidate pixel locations proximate to the bestcandidate pixel location of the first level of accuracy that are betweenthe best candidate pixel location of the first level of accuracy and thesecond best candidate pixel location of the second level of accuracy. 3.The method according to claim 1, wherein processing the input videosequence to determine the motion vector at the first level of accuracycomprises determining the best candidate pixel location of the firstlevel of accuracy corresponding to a candidate block in a referenceframe that most closely matches an original block at the first level ofaccuracy.
 4. The method according to claim 1, wherein refining themotion vector at the second level of accuracy comprises determining thebest candidate pixel location of the second level of accuracycorresponding to a candidate block in a reference frame that mostclosely matches an original block at the second level of accuracy. 5.The method according to claim 1, wherein determining the motion vectorat the third level of accuracy comprises determining the best candidatepixel location of the third level of accuracy corresponding to acandidate block in a reference frame that most closely matches anoriginal block at the third level of accuracy.
 6. The method accordingto claim 1, wherein selecting the subset of candidate pixel locationscomprises selecting less than half of a total number of candidate pixellocations.